Multiplicative Operations in Bp*bp

نویسنده

  • DOUGLAS C. RAVENEL
چکیده

where S is the Landweber-Novikov algebra. S has the added advantage of being a cocommutative Hopf algebra over Z. This paper does not remove this difficulty, but we will show that the monoid of multiplicative operations in BP*BP, (i.e. those operations which induce ring endomorphisms on BP*X for any space X)9 which we will denote by Γ{BP), has a submonoid analogous to the monoid of multiplicative operations in S.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BP Operations and Morava's Extraordinary K-Theories

In a series of papers [17-19] Morava uses an infinite sequence of extraordinary K-theories to give an elegant structure theorem for the complex cobordism of a finite complex. Much of Morava's theory is embedded in a rather sophisticated algebraic setting. In our attempt to understand his work, we have found more conventional algebraic topological proofs of many of his results. Also, our approac...

متن کامل

Molecular linkage studies of bipolar disorder

Linkage studies have defined at least five bipolar (BP) disorder susceptibility loci that meet suggested guidelines for initial identification and subsequent confirmation. These loci, found on 18p11, 18q22, 21q21, 4p16, and Xq26, are targets for BP candidate gene investigations. Molecular dissection of expressed sequences for these regions is likely to yield specific BP susceptibility alleles i...

متن کامل

Counting Independent Sets Using the Bethe Approximation

We consider the #P complete problem of counting the number of independent sets in a given graph. Our interest is in understanding the effectiveness of the popular Belief Propagation (BP) heuristic. BP is a simple and iterative algorithm that is known to have at least one fixed point. Each fixed point corresponds to a stationary point of the Bethe free energy (introduced by Yedidia, Freeman and ...

متن کامل

Belief Propagation for Min-Cost Network Flow: Convergence and Correctness

Distributed, iterative algorithms operating with minimal data structure while performing little computation per iteration are popularly known as message-passing in the recent literature. Belief Propagation (BP), a prototypical message-passing algorithm, has gained a lot of attention across disciplines including communications, statistics, signal processing and machine learning as an attractive ...

متن کامل

A pr 2 01 2 CENTRAL COHOMOLOGY OPERATIONS AND K - THEORY

For stable degree zero operations, and also for additive unstable operations of bidegree (0, 0), it is known that the centre of the ring of operations for complex cobordism is isomorphic to the corresponding ring of connective complex K-theory operations. Similarly, the centre of the ring of BP operations is the corresponding ring for the Adams summand of p-local connective complex K-theory. He...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004